2 1 Ja n 19 97 Circles , Spheres and Drops Packings
نویسنده
چکیده
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non– overlapping, polydisperse circle–packings. We found that the size distribution of circles that densely cover a plane follows the power law: N(R) ∝ R. We obtained an approximate expression which relates the exponent α to the average coordination number and to the packing strategy. In the case of disordered packings (where the circles have random sizes and positions) we found the upper bound αMax = 2. The results obtained for circles–packing was extended to packing of spheres and hyper–spheres in spaces of arbitrary dimension D. We found that the size distribution of dense packed polydisperse D–spheres, follows –as in the two dimensional case– a power law, where the exponent α depends on the packing strategy. In particular, in the case of disordered packing, we obtained the upper bound αMax = D. Circle–covering generated by computer simulations, gives size distributions that are in agreement with these analytical predictions. Tin drops generated by vapour deposition on a hot substrate form breath figures where the drop–size distributions are power laws with exponent α ≃ 2. We pointed out the similarity between these structures and the circle-packings. Despite the complicated mechanism of formation of these structures, we showed that it is possible to describe the drops arrangements, the size distribution and the evolution at constant coverage, in term of maximum packing of circles regulated by coalescence.
منابع مشابه
Growing Apollonian Packings
In two dimensions, start with three mutually tangent circles, with disjoint interiors (a circle with negative radius has the point at infinity in its interior). We can draw two new circles that touch these three, and then six more in the gaps that are formed, and so on. This procedure generates an (infinite) Apollonian packing of circles. We show that the sum of the bends (curvatures) of the ci...
متن کاملDense packings of congruent circles in a circle
The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the best packings found of up to 65 circles are presented.
متن کاملThe Dense Packing of 13 Congruent Circles in a Circle
The densest packings of n congruent circles in a circle are known for n 12 and n = 19. In this paper we exhibit the densest packings of 13 congruent circles in a circle. We show that the optimal con gurations are identical to Kravitz's [11] conjecture. We use a technique developed from a method of Bateman and Erd}os [1] which proved fruitful in investigating the cases n = 12 and 19 by the autho...
متن کاملCFD Simulation of Dry and Wet Pressure Drops and Flow Pattern in Catalytic Structured Packings
Type of packings and characteristics of their geometry can affect the flow behavior in the reactive distillation columns. KATAPAK SP is one the newest modular catalytic structured packings (MCSP) that has been used in the reactive distillation columns, recently. However, there is not any study on the hydrodynamics of this packing by using computational fluid dynamics. In the present work, a 3D ...
متن کاملApollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions
This paper gives n-dimensional analogues of the Apollonian circle packings in parts I and II. Those papers considered circle packings described in terms of their Descartes configurations, which are sets of four mutually touching circles. They studied packings that had integrality properties in terms of the curvatures and centers of the circles. Here we consider collections of n-dimensional Desc...
متن کامل